Graphs with Large Distinguishing Chromatic Number
نویسندگان
چکیده
The distinguishing chromatic number χD(G) of a graph G is the minimum number of colours required to properly colour the vertices of G so that the only automorphism of G that preserves colours is the identity. For a graph G of order n, it is clear that 1 6 χD(G) 6 n, and it has been shown that χD(G) = n if and only if G is a complete multipartite graph. This paper characterizes the graphs G of order n satisfying χD(G) = n− 1 or χD(G) = n− 2.
منابع مشابه
The distinguishing chromatic number of bipartite graphs of girth at least six
The distinguishing number $D(G)$ of a graph $G$ is the least integer $d$ such that $G$ has a vertex labeling with $d$ labels that is preserved only by a trivial automorphism. The distinguishing chromatic number $chi_{D}(G)$ of $G$ is defined similarly, where, in addition, $f$ is assumed to be a proper labeling. We prove that if $G$ is a bipartite graph of girth at least six with the maximum ...
متن کاملThe locating-chromatic number for Halin graphs
Let G be a connected graph. Let f be a proper k -coloring of G and Π = (R_1, R_2, . . . , R_k) bean ordered partition of V (G) into color classes. For any vertex v of G, define the color code c_Π(v) of v with respect to Π to be a k -tuple (d(v, R_1), d(v, R_2), . . . , d(v, R_k)), where d(v, R_i) is the min{d(v, x)|x ∈ R_i}. If distinct vertices have distinct color codes, then we call f a locat...
متن کاملThe Gap between the Chromatic number and the Distinguishing Chromatic Number
The Distinguishing Chromatic Number of a graph G, denoted χD(G), was first defined in [5] as the minimum number of colors needed to properly color G such that no non-trivial automorphism φ of the graph G fixes each color class of G. In this paper, we consider certain ‘natural’ families of bipartite graphs that have reasonably large automorphism groups and we show that in all those cases, the di...
متن کاملThe Distinguishing Chromatic Number
In this paper we define and study the distinguishing chromatic number, χD(G), of a graph G, building on the work of Albertson and Collins who studied the distinguishing number. We find χD(G) for various families of graphs and characterize those graphs with χD(G) = |V (G)|, and those trees with the maximum chromatic distingushing number for trees. We prove analogs of Brooks’ Theorem for both the...
متن کاملDistinguishing Chromatic Numbers of Bipartite Graphs
Extending the work of K. L. Collins and A.N. Trenk, we characterize connected bipartite graphs with large distinguishing chromatic number. In particular, if G is a connected bipartite graph with maximum degree ∆ ≥ 3, then χD(G) ≤ 2∆ − 2 whenever G 6∼= K∆−1,∆, K∆,∆.
متن کاملDistinguishing Chromatic Number of Cartesian Products of Graphs
The distinguishing chromatic number χD (G) of a graph G is the least integer k such that there is a proper k-coloring of G which is not preserved by any nontrivial automorphism of G. We study the distinguishing chromatic number of Cartesian products of graphs by focusing on how much it can exceed the trivial lower bound of the chromatic number χ(·). Our main result is that for every graph G, th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Electr. J. Comb.
دوره 20 شماره
صفحات -
تاریخ انتشار 2013